Trapezoidal matrices and the bottleneck assignment problem
نویسندگان
چکیده
منابع مشابه
Approximating the Multi-level Bottleneck Assignment Problem
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book “Assignment Problems” by Burkard et al. (2009) on pages 188 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximabi...
متن کاملAsymptotic Moments of the Bottleneck Assignment Problem
One of the most important variants of the standard linear assignment problem is the bottleneck assignment problem. In this paper we give a method by which one can find all of the asymptotic moments of a random bottleneck assignment problem in which costs (independent and identically distributed) are chosen from a wide variety of continuous distributions. Our method is obtained by determining th...
متن کاملMulti-objective Assignment Problem with Generalized Trapezoidal Fuzzy Numbers
The aim of this paper is to study multi-objective assignment problem with imprecise costs, time and ineffectiveness instead of its precise information. Here, elements of cost matrix, consumed time matrix and ineffectiveness level matrix have been represented by generalized trapezoidal fuzzy numbers as it is suitable way to represent the impreciseness of values provided by the decision makers du...
متن کاملOn the Approximability of Multi-level Bottleneck Assignment Problem
We revisit the multi-level bottleneck assignment problem and study the approximability when there are m > 3 sets. We show that with respect to the approximability the problem exhibits an easy to hard transition. More specifically, we give a PTAS to the easiest hard case which is when the alternative edge-sets are complete, and prove that it is NP-hard to approximate the problem to within a rati...
متن کاملOn The Bottleneck and Capacity Assignment Problems
The bottleneck (capacity) assignment problem seeks for a set of entries in a matrix A, one for each column and row, that minimizes (maximizes) the largest (smallest) element over all such sets. Our interest lies in finding the asymptotically exact solution to these problems in a probabilistic framework, that is, under the asswnption that elements in the matrix are independent random variables w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0122-f